What is Quantum Random Walk?

ثبت نشده
چکیده

• Classical: random walk in one dimension describes a particle that moves in the positive or negative direction according to the random outcome of some unbiased binary variable (e.g., a fair coin). • Quantum: The particle with two degree of freedom (for example spin) can move left or right according to its spin and one unitary operator can play coin roles (for example Hadamard operator).In quantum random walk (QRW) we have 2 operator, coin operator (C) and translation operator (S).C act on Hilbert space of particle’s spin (coin space) HC and S act on Hilbert space of particle’s position HP. C makes superposition of particle’s spin and S moves particle left or right according to particle’s spin. The QRW of n step defined as the transformation Un, where U, acting on H= HC ⊗ HP . ( ) I C S U ⊗ = . ,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Random Walks in One Dimension

Abstract. This letter treats the quantum random walk on the line determined by a 2 × 2 unitary matrix U . A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P,Q,R and S given by U . The dependence of the mth moment on U and initial qubit state φ is clarified. A new type of limit theorems for the quantum walk is given. Furthermore necessary...

متن کامل

Coassociative Grammar, Periodic Orbits, and Quantum Random Walk over Z

Motivated by the success of classical random walks and chaotic dynamical systems, we study the quantisation of the random walk over Z and its relationships with a classical chaotic system x → 2xmod1, x ∈ [0,1]. In the physics literature, quantum random walks have been studied, for instance, by Ambainis et al. [1] and Konno et al. [8, 9]. In [8], Konno shows that the quantum random walk over Z c...

متن کامل

A random walk approach to quantum algorithms.

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The ou...

متن کامل

Decoherence in Quantum Walks on the Hypercube

The notion of a quantum random walk has emerged as an important element in the development of efficient quantum algorithms. In particular, it makes a dramatic appearance in the most efficient known algorithm for element distinctness [1]. The technique has also been applied to offer simple separations between quantum and classical query complexity [5]. The basic model has two natural variants, t...

متن کامل

Quantum random walks with history dependence

We introduce a multi-coin discrete quantum random walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying the history dependence. By mixing the biased random walk with an unbiased one, the direction of the bias can be reversed leading to a new quantum version of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007